Satellite closest approach calculation through Chebyshev Proxy Polynomials
نویسندگان
چکیده
منابع مشابه
Symmetrized Chebyshev Polynomials
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...
متن کاملModeling and Segmentation of Ecg Signals through Chebyshev Polynomials
ECG (Electrocardiogram) signals originating from heart muscles, generate massive volume of digital data. They need to be compressed or approximated for efficient transmission and storage. ECG signal compression is traditionally performed in three ways: direct, transform and parameter extraction. Polynomial approximation which is a form of parameter extraction method, is employed here. This pape...
متن کاملPolynomials Related to Generalized Chebyshev Polynomials
We study several classes of polynomials, which are related to the Chebyshev, Morgan-Voyce, Horadam and Jacobsthal polynomials. Thus, we unify some of well-known results.
متن کاملOn integer Chebyshev polynomials
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...
متن کاملCryptography using Chebyshev polynomials
We consider replacing the monomial xn with the Chebyshev polynomial Tn(x) in the Diffie-Hellman and RSA cryptography algorithms. We show that we can generalize the binary powering algorithm to compute Chebyshev polynomials, and that the inverse problem of computing the degree n, the discrete log problem for Tn(x) mod p, is as difficult as that for xn mod p.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Astronautica
سال: 2020
ISSN: 0094-5765
DOI: 10.1016/j.actaastro.2020.01.020